Efficient Processing of XML Twig Pattern: A Novel One-Phase Holistic Solution

نویسندگان

  • Zhewei Jiang
  • Cheng Luo
  • Wen-Chi Hou
  • Qiang Zhu
  • Dunren Che
چکیده

Modern twig query evaluation algorithms usually first generate individual path matches and then stitch them together (through a “merge” operation) to form twig matches. In this paper, we propose a one-phase holistic twig evaluation algorithm based on the TwigStack algorithm. The proposed method applies a novel stack structure to preserve the holisticity of the twig matches. Without generating intermediate path matches, our method avoids the storage of individual path matches and the path merge process. Experimental results confirm the advantages of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient XML tree pattern query evaluation using a novel one-phase holistic twig join scheme

Purpose of this paper This paper aims to provide an efficient algorithm for XML twig query evaluation. Design/Methodology/Approach In this chapter, we propose a single-phase holistic twig pattern matching method based on the TwigStack algorithm. Our method applies a novel stack structure to preserve the holisticity of the twig matches. Twig matches rooted at elements that are currently in the r...

متن کامل

Efficient Processing of Ordered XML Twig Pattern

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiority over binary decompose based approach due to efficient reducing intermediate results. The existing holistic join algorithms, however, cannot deal with ordered twig queries. A straightforward approach that first match...

متن کامل

Holistic Twig Joins on Indexed XML Documents

Finding all the occurrences of a twig pattern specified by a selection predicate on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms were proposed recently as an optimal solution when the twig pattern only involves ancestordescendant relationships. In this paper, we address the problem of efficient processing of holi...

متن کامل

TwigStackList-: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data

As business and enterprises generate and exchange XML data more often, there is an increasing need for searching and querying XML data. A lot of researches have been done to match XML twig queries. However, as far as we know, very little work has examined the efficient processing of XML twig queries with not-predicates. In this paper, we propose a novel holistic twig join algorithm, called Twig...

متن کامل

Fast Matching of Twig Patterns

Twig pattern matching plays a crucial role in xml data processing. Existing twig pattern matching algorithms can be classified into two-phase algorithms and one-phase algorithms. While the two-phase algorithms (e.g., TwigStack) suffer from expensive merging cost, the onephase algorithms (e.g., TwigList, Twig2Stack, HolisticTwigStack) either lack efficient filtering of useless elements, or use o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007